Average-case complexity - PDFSEARCH.IO - Document Search Engine

Average-case complexity
Results: 45

#	Item
31	Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel1 Cedric Chauve2 Dominique Rossin1 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-24 09:20:20 Computational complexity theory Abstract algebra Permutation Best worst and average case Sorting Sorting algorithms Mathematics Combinatorics
32	Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003) Add to Reading List Source URL: www.mit.edu Language: English - Date: 2006-02-03 21:38:13 Computational complexity theory Online algorithms Algorithm Competitive analysis Best worst and average case Asymptotically optimal algorithm Approximation algorithm Theoretical computer science Applied mathematics Analysis of algorithms
33	CALL FOR PAPERS ANALYSIS OF ALGORITHMS Special Issue in Algorithmica Average-Case Analysis of Algorithms is the area of Theoretical Computer Science that studies the behavior of algorithms on random inputs. The focus is Add to Reading List Source URL: algo.inria.fr Language: English - Date: 2004-11-13 12:22:28 Computer science Mathematics Probabilistic analysis of algorithms Algorithm Randomized algorithm Best worst and average case Combinatorics Amortized analysis Analysis of algorithms Applied mathematics Probabilistic complexity theory
34	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: www.karlin.mff.cuni.cz Language: English - Date: 2011-12-13 09:31:41 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
35	PDF Document Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2012-07-05 15:06:24 Mathematics Computational complexity theory Time complexity Algorithm Big O notation Merge sort Sorting algorithm Best worst and average case Asymptotically optimal algorithm Theoretical computer science Analysis of algorithms Applied mathematics
36	Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time ∗ arXiv:cs/0111050v7 [cs.DS] 9 Oct[removed]Daniel A. Spielman † Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-02-01 13:52:50 Analysis of algorithms Computational complexity theory Smoothed analysis Linear programming Simplex algorithm Algorithm Normal distribution Simplex Best worst and average case Theoretical computer science Applied mathematics Mathematics
37	ABRAHAM FLAXMAN, Carnegie Mellon University, Pittsburgh, PA, USA On the Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem In combinatorial optimization, a po Add to Reading List Source URL: cms.math.ca Language: English - Date: 2006-07-10 21:18:20 Computational complexity theory Operations research Approximation algorithm Asymptotically optimal algorithm Algorithm Optimization problem Combinatorial optimization Facility location Greedy algorithm Theoretical computer science Applied mathematics Mathematics
38	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: stuff.mit.edu Language: English - Date: 2009-05-25 23:54:59 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
39	Symposium on Theoretical Aspects of Computer Science[removed]Nancy, France), pp[removed]www.stacs-conf.org COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES XIAOYANG GU 1 AND JOHN Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-04 08:18:12 Complexity classes NP-complete NP Reduction P/poly Advice Many-one reduction Turing reduction Polynomial-time reduction Theoretical computer science Computational complexity theory Applied mathematics
40	Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003) Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2006-02-03 21:38:13 Computational complexity theory Online algorithms Algorithm Competitive analysis Best worst and average case Asymptotically optimal algorithm Approximation algorithm Theoretical computer science Applied mathematics Analysis of algorithms

UPDATE